منابع مشابه
Concurrent Abstract State Machines and +CAL Programs
We apply the ASM semantics framework to define the await construct in the context of concurrent ASMs. We link CAL programs to concurrent control state ASMs with turbo ASM submachines.
متن کاملWSMO Choreography: From Abstract State Machines to Concurrent Transaction Logic
Several approaches to semantic Web services, including OWLS, SWSF, and WSMO, have been proposed in the literature with the aim to enable automation of various tasks related to Web services, including discovery, contracting, enactment, monitoring, and mediation. The ability to specify processes and to reason about them is central to these initiatives. In this paper we analyze the WSMO choreograp...
متن کاملTimed Concurrent State Machines
Timed Concurrent State Machines are an application of Alur’s Timed Automata concept to coincidencebased (rather than interleaving) CSM modeling technique. TCSM support the idea of testing automata, allowing to specify time properties easier than temporal formulas. Also, calculation of a global state space in realtime domain is defined for TCSM, allowing to store a system in ...
متن کاملRecursive Abstract State Machines
According to the ASM thesis, any algorithm is essentially a Gurevich abstract state machine. The only objection to this thesis, at least in its sequential version, has been that ASMs do not capture recursion properly. To this end, we suggest recursive ASMs.
متن کاملTyped Abstract State Machines
As introduced in the Lipari guide, Abstract State Machines (abbreviated as ASMs) are untyped. This is useful for many purposes. However, typed languages have their own advantages. Types structure the data, type checking uncovers errors. Here we propose a typed version of ASMs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2015
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-015-0249-7